Routing optimization with path cardinality constraints in a hybrid SDN
نویسندگان
چکیده
منابع مشابه
Portfolio Optimization with Cardinality Constraints Based on Hybrid Differential Evolution
A portfolio optimal model with cardinality constraints is researched, in which the minimum of Value-at-Risk is taken as the objective function. We give a hybrid differential evolution algorithm to solve the model and make the case study with sixteen alternative stocks from Shanghai and Shenzhen stock market. The numerical results show that the given model is reasonable and the given algorithm i...
متن کاملSubmodular Optimization with Routing Constraints
Submodular optimization, particularly under cardinality or cost constraints, has received considerable attention, stemming from its breadth of application, ranging from sensor placement to targeted marketing. However, the constraints faced in many real domains are more complex. We investigate an important and very general class of problems of maximizing a submodular function subject to general ...
متن کاملA Multi-path Hybrid Routing Algorithm in Network Routing
The shortest path tree construction is essential in network routing, and the Dijkstra algorithm, which is a static routing algorithm, is widely used. When some links in a network have new weights, dynamic routing algorithms are more efficient than static routing algorithms. This is because the dynamic routing algorithms reduce redundancy by recomputing only the affected sections of the network ...
متن کاملLogistics Optimization: Vehicle Routing with Loading Constraints
In today’s global markets, enterprises are integrated in order to produce value for the end customers: this network is referred as Supply Chain (SC). Transportation Management (TM) is one of the SC processes. TM decisions include, among others, load planning (referred as Container Loading Problem CLP) and delivery route planning (referred as Vehicle Routing Problem VRP). Several authors address...
متن کاملSubmodular Maximization with Cardinality Constraints
We consider the problem of maximizing a (non-monotone) submodular function subject to a cardinality constraint. In addition to capturing well-known combinatorial optimization problems, e.g., Maxk-Coverage and Max-Bisection, this problem has applications in other more practical settings such as natural language processing, information retrieval, and machine learning. In this work we present impr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Communications
سال: 2021
ISSN: 0140-3664
DOI: 10.1016/j.comcom.2020.11.004